334 research outputs found

    First-order formative rules

    Get PDF
    This paper discusses the method of formative rules for first-order term rewriting, which was previously defined for a higher-order setting. Dual to the well-known usable rules, formative rules allow dropping some of the term constraints that need to be solved during a termination proof. Compared to the higher-order definition, the first-order setting allows for significant improvements of the technique

    Proving termination of programs automatically with AProVE

    Get PDF
    AProVE is a system for automatic termination and complexity proofs of Java, C, Haskell, Prolog, and term rewrite systems (TRSs). To analyze programs in high-level languages, AProVE automatically converts them to TRSs. Then, a wide range of techniques is employed to prove termination and to infer complexity bounds for the resulting TRSs. The generated proofs can be exported to check their correctness using automatic certifiers. For use in software construction, we present an AProVE plug-in for the popular Eclipse software development environment

    Synchronous counting and computational algorithm design

    Get PDF
    Consider a complete communication network on n nodes, each of which is a state machine with s states. In synchronous 2-counting, the nodes receive a common clock pulse and they have to agree on which pulses are “odd” and which are “even”. We require that the solution is self-stabilising (reaching the correct operation from any initial state) and it tolerates f Byzantine failures (nodes that send arbitrary misinformation). Prior algorithms are expensive to implement in hardware: they require a source of random bits or a large number of states s. We use computational techniques to construct very compact deterministic algorithms for the first non-trivial case of f = 1. While no algorithm exists for n < 4, we show that as few as 3 states are sufficient for all values n ≥ 4. We prove that the problem cannot be solved with only 2 states for n = 4, but there is a 2-state solution for all values n ≥ 6.Peer reviewe

    Analyzing program termination and complexity automatically with AProVE

    Get PDF
    In this system description, we present the tool AProVE for automatic termination and complexity proofs of Java, C, Haskell, Prolog, and rewrite systems. In addition to classical term rewrite systems (TRSs), AProVE also supports rewrite systems containing built-in integers (int-TRSs). To analyze programs in high-level languages, AProVE automatically converts them to (int-)TRSs. Then, a wide range of techniques is employed to prove termination and to infer complexity bounds for the resulting rewrite systems. The generated proofs can be exported to check their correctness using automatic certifiers. To use AProVE in software construction, we present a corresponding plug-in for the popular Eclipse software development environment

    A static higher-order dependency pair framework

    Get PDF
    We revisit the static dependency pair method for proving termination of higher-order term rewriting and extend it in a number of ways: (1) We introduce a new rewrite formalism designed for general applicability in termination proving of higher-order rewriting, Algebraic Functional Systems with Meta-variables. (2) We provide a syntactically checkable soundness criterion to make the method applicable to a large class of rewrite systems. (3) We propose a modular dependency pair framework for this higher-order setting. (4) We introduce a fine-grained notion of formative and computable chains to render the framework more powerful. (5) We formulate several existing and new termination proving techniques in the form of processors within our framework. The framework has been implemented in the (fully automatic) higher-order termination tool WANDA

    Solving Navigational Uncertainty Using Grid Cells on Robots

    Get PDF
    To successfully navigate their habitats, many mammals use a combination of two mechanisms, path integration and calibration using landmarks, which together enable them to estimate their location and orientation, or pose. In large natural environments, both these mechanisms are characterized by uncertainty: the path integration process is subject to the accumulation of error, while landmark calibration is limited by perceptual ambiguity. It remains unclear how animals form coherent spatial representations in the presence of such uncertainty. Navigation research using robots has determined that uncertainty can be effectively addressed by maintaining multiple probabilistic estimates of a robot's pose. Here we show how conjunctive grid cells in dorsocaudal medial entorhinal cortex (dMEC) may maintain multiple estimates of pose using a brain-based robot navigation system known as RatSLAM. Based both on rodent spatially-responsive cells and functional engineering principles, the cells at the core of the RatSLAM computational model have similar characteristics to rodent grid cells, which we demonstrate by replicating the seminal Moser experiments. We apply the RatSLAM model to a new experimental paradigm designed to examine the responses of a robot or animal in the presence of perceptual ambiguity. Our computational approach enables us to observe short-term population coding of multiple location hypotheses, a phenomenon which would not be easily observable in rodent recordings. We present behavioral and neural evidence demonstrating that the conjunctive grid cells maintain and propagate multiple estimates of pose, enabling the correct pose estimate to be resolved over time even without uniquely identifying cues. While recent research has focused on the grid-like firing characteristics, accuracy and representational capacity of grid cells, our results identify a possible critical and unique role for conjunctive grid cells in filtering sensory uncertainty. We anticipate our study to be a starting point for animal experiments that test navigation in perceptually ambiguous environments

    Mechanical properties of murine hippocampal subregions investigated by atomic force microscopy and in vivo magnetic resonance elastography

    Get PDF
    The hippocampus is a very heterogeneous brain structure with different mechanical properties reflecting its functional variety. In particular, adult neurogenesis in rodent hippocampus has been associated with specific viscoelastic properties in vivo and ex vivo. Here, we study the microscopic mechanical properties of hippocampal subregions using ex vivo atomic force microscopy (AFM) in correlation with the expression of GFP in presence of the nestin promoter, providing a marker of neurogenic activity. We further use magnetic resonance elastography (MRE) to investigate whether in vivo mechanical properties reveal similar spatial patterns, however, on a much coarser scale. AFM showed that tissue stiffness increases with increasing distance from the subgranular zone (p = 0.0069), and that stiffness is 39% lower in GFP than non-GFP regions (p = 0.0004). Consistently, MRE showed that dentate gyrus is, on average, softer than Ammon's horn (shear wave speed = 3.2 ± 0.2 m/s versus 4.4 ± 0.3 m/s, p = 0.01) with another 3.4% decrease towards the subgranular zone (p = 0.0001). The marked reduction in stiffness measured by AFM in areas of high neurogenic activity is consistent with softer MRE values, indicating the sensitivity of macroscopic mechanical properties in vivo to micromechanical structures as formed by the neurogenic niche of the hippocampus

    Accurate path integration in continuous attractor network models of grid cells

    Get PDF
    Grid cells in the rat entorhinal cortex display strikingly regular firing responses to the animal's position in 2-D space and have been hypothesized to form the neural substrate for dead-reckoning. However, errors accumulate rapidly when velocity inputs are integrated in existing models of grid cell activity. To produce grid-cell-like responses, these models would require frequent resets triggered by external sensory cues. Such inadequacies, shared by various models, cast doubt on the dead-reckoning potential of the grid cell system. Here we focus on the question of accurate path integration, specifically in continuous attractor models of grid cell activity. We show, in contrast to previous models, that continuous attractor models can generate regular triangular grid responses, based on inputs that encode only the rat's velocity and heading direction. We consider the role of the network boundary in the integration performance of the network and show that both periodic and aperiodic networks are capable of accurate path integration, despite important differences in their attractor manifolds. We quantify the rate at which errors in the velocity integration accumulate as a function of network size and intrinsic noise within the network. With a plausible range of parameters and the inclusion of spike variability, our model networks can accurately integrate velocity inputs over a maximum of ~10–100 meters and ~1–10 minutes. These findings form a proof-of-concept that continuous attractor dynamics may underlie velocity integration in the dorsolateral medial entorhinal cortex. The simulations also generate pertinent upper bounds on the accuracy of integration that may be achieved by continuous attractor dynamics in the grid cell network. We suggest experiments to test the continuous attractor model and differentiate it from models in which single cells establish their responses independently of each other

    Dot Display Affects Approximate Number System Acuity and Relationships with Mathematical Achievement and Inhibitory Control

    Get PDF
    Much research has investigated the relationship between the Approximate Number System (ANS) and mathematical achievement, with continued debate surrounding the existence of such a link. The use of different stimulus displays may account for discrepancies in the findings. Indeed, closer scrutiny of the literature suggests that studies supporting a link between ANS acuity and mathematical achievement in adults have mostly measured the ANS using spatially intermixed displays (e.g. of blue and yellow dots), whereas those failing to replicate a link have primarily used spatially separated dot displays. The current study directly compared ANS acuity when using intermixed or separate dots, investigating how such methodological variation mediated the relationship between ANS acuity and mathematical achievement. ANS acuity was poorer and less reliable when measured with intermixed displays, with performance during both conditions related to inhibitory control. Crucially, mathematical achievement was significantly related to ANS accuracy difference (accuracy on congruent trials minus accuracy on incongruent trials) when measured with intermixed displays, but not with separate displays. The findings indicate that methodological variation affects ANS acuity outcomes, as well as the apparent relationship between the ANS and mathematical achievement. Moreover, the current study highlights the problem of low reliabilities of ANS measures. Further research is required to construct ANS measures with improved reliability, and to understand which processes may be responsible for the increased likelihood of finding a correlation between the ANS and mathematical achievement when using intermixed displays

    ESR observations of paramagnetic centers in intrinsic hydrogenated microcrystalline silicon

    Get PDF
    Paramagnetic centers in hydrogenated microcrystalline silicon, µc-Si:H have been studied using dark and light-induced electron-spin resonance (ESR). In dark ESR measurements only one center is observed. The g values obtained empirically from powder-pattern line-shape simulations are g=2.0096 and g'=2.0031. We suggest that this center may be due to defects in the crystalline phase. During illumination at low temperatures, an additional ESR signal appears. This signal is best described by two powder patterns indicating the presence of two centers. One center is asymmetric (gi=1.999, g'=1.996), while the other is characterized by large, unresolved broadening such that unique g values cannot be obtained. The average g value for this center is 1.998. The light-induced signal, which we interpret as coming from carriers trapped in the band tails at the crystalline grain boundaries, remains for at least several minutes after the light is turned off. Although the time scales of the decay curves are very different for two samples prepared by different techniques, both decays can be fitted using the assumption of recombination due to distant pairs of electrons and holes trapped in localized band-tail states
    corecore